Routing two stacking cranes with predetermined container sequences

Abstract The scheduling of gantry cranes with respect to mutual interference has received considerable attention in recent years. We consider a subproblem which arises when each crane sequence tasks be assigned. problem is concerned resolving the between two by determining avoids other order let it complete its next task first. provide fairly general framework accounting for different systems and various side constraints. assume cost function that determines completing at specific point time. then distinguish objectives minimize both total maximum among tasks. A dynamic programming provided allows us solve all versions pseudo-polynomial Furthermore, we show while aiming minimum binary NP-hard, can solved polynomial Finally, address important special cases former, they time as well.